Decentralized group signature scheme for credential systems with issuer anonymization

ABSTRACT

A decentralized group signature method for an issuer-anonymized credential system includes (a) an initial system setup operation of defining elements of a group signature method and information that is generated and shared by each group member, (b) an initial group member setup operation, (c) a group member participation operation of adding a new group member to a group, (d) a group signature operation of putting a group signature on a specific message, (e) an operation of verifying the group signature, (f) an operation of removing anonymity from a group signature for a specific group member with agreement of group members, and (g) an operation of revoking a specific group member with agreement of the group members. Exclusive authority of a group manager is distributed to the group members.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to and the benefit of Korean Patent Application No. 10-2019-0139894, filed on Nov. 5, 2019, the disclosure of which is incorporated herein by reference in its entirety.

BACKGROUND 1. Field of the Invention

The present invention relates to a decentralized group signature scheme for credential systems with issuer anonymization.

2. Description of Related Art

Group signature schemes are widely adopted to systems requiring anonymization of group members who have signed messages. A group signature scheme often mandates a group manager who is entirely trusted by all group members; the group manager establishes keys, adds new members, and reveals a signer by removing anonymity of a signature if necessary.

Group signature schemes have been improved to decentralize the empowerment of the group manager so that the group can be instead managed by consensus of the group members. For example, the (t, n)-threshold attribute, requiring at least t consenting members out of the total of n members, can be established as the rule of the consensus in adding a new member or removing the anonymity of a signature.

On the other hand, a digital credential system is devised as a centralized platform in providing services regarding verification of various matters such as individual personal identifications, academic degree and employment proof. In particular, anonymous credential systems have been vigorously researched for personal privacy protection and credential safety. Most widely known such systems are Identity Mixer (IdeMix) by IBM and U-Prove by Microsoft.

An anonymous credential system may hide or process partial information about a credential to allow the credential to be used as a proof and may give a pseudonym to an identity owner to prevent the identity owner from being identified by an identification issuer and a verifier.

The anonymous credential systems often facilitate the selective disclosure feature which enables the identity owner to prove only a subset of attributes in a credential. However, the identity owner cannot hide the identity of the credential issuer since the credential verifier should depend on the validity of the issuer's identity.

However, inadvertent identification of the issuer may cause a privacy breach in some cases. Consider a blind recruitment scenario where the applicants need to prove their qualification for a position without revealing their personal identity or the name of university they have attended. Normally, an applicant who is an alumnus of a certain university submits a graduate certificate or original transcript digitally signed by the university to prove their academic degree or GPA. The verifier, the recruiting company, verifies the digital signature of the submitted document given the validity of the issuer's identity; the recruiting company will identify the university to which the applicant has attended.

To solve this inadvertent identification problem, issuers may group a consortium and issue signed certificates anonymously (among the consortium members). The verifiers verify the content of signed credentials based on the trust of the consortium as a whole. In the scenario, universities may form a nation-wide university credential consortium and issue their credentials using the unidentifiable signature key of the consortium.

One may utilize a group signature scheme in such a credential consortium. However, group signature schemes mandate a group manager who has the sole discretion of member addition or revocation. Hence, a decentralized group signature scheme can benefit such consortium-based credential systems by distributing the empowerment of the group manager.

SUMMARY OF THE INVENTION

The present invention is directed to providing a decentralized group signature method which is used in a credential system to ensure anonymity of an issuer by distributing exclusive authority of a group manager (representative) to group members.

According to an aspect of the present invention, there is provided a decentralized group signature method, the method including (a) an initial system setup operation of defining elements of a group signature method and information which is generated and shared by each group member, (b) an initial group member setup operation, (c) a group member participation operation of adding a new group member to a group, (d) a group signature operation of putting a group signature on a specific message, (e) an operation of verifying the group signature, (f) an operation of removing anonymity from a group signature for a specific group member with agreement of group members, and (g) an operation of expelling a specific group member with agreement of the group members. Exclusive authority of a group manager is distributed to the group members.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other objects, features and advantages of the present invention will become more apparent to those of ordinary skill in the art by describing exemplary embodiments thereof in detail with reference to the accompanying drawings, in which:

FIG. 1 is a flowchart illustrating a decentralized group signature method for an issuer-anonymized credential system according to an exemplary embodiment of the present invention;

FIGS. 2 to 4 illustrate an initial group member setup operation according to the exemplary embodiment of the present invention;

FIGS. 5 and 6 illustrate a group member participation operation according to the exemplary embodiment of the present invention;

FIGS. 7 to 9 illustrate a group signature operation according to the exemplary embodiment of the present invention;

FIG. 10 illustrates a group signature verification operation according to the exemplary embodiment of the present invention;

FIG. 11 illustrates a group member anonymity removal operation according to the exemplary embodiment of the present invention;

FIG. 12 illustrates a group member anonymity removal operation and a group member revoking operation according to the exemplary embodiment of the present invention;

FIGS. 13 and 14 illustrate protocol flows in an anonymous authentication system according to the exemplary embodiment of the present invention;

FIG. 15 is a table showing parameters related to the anonymous authentication system according to the exemplary embodiment of the present invention;

FIG. 16 is a table showing parameter sizes related to the anonymous authentication system according to the exemplary embodiment of the present invention; and

FIGS. 17 to 19 illustrate flow among a group member, a recipient, and a verifier according to the exemplary embodiment of the present invention.

FIG. 20 is a view illustrating an example of a computer system in which a method according to an embodiment of the present invention is performed.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

The aforementioned object, other objects, advantages, and features of the present invention and methods for achieving them will be made clear from exemplary embodiments described below in detail with reference to the accompanying drawings.

However, the present invention is not limited to the exemplary embodiments disclosed below and can be embodied in various different forms. The embodiments are provided so that this disclosure of the present invention may be thorough and complete and may fully convey the scope of the invention to those of ordinary skill in the art. The present invention is defined by the claims.

Meanwhile, terminology used in this specification is for the purpose of describing the embodiments and is not intended to limit the present invention. In this specification, the singular forms include the plural forms as well unless the context clearly indicates otherwise. The terms “comprise” and/or “comprising” when used, herein do not preclude the presence or addition of one or more elements, steps, operations, and/or devices other than stated elements, steps, operations, and/or devices.

According to an exemplary embodiment of the present invention, in all processes, including an initial process for group members, such as, key generation, a process of adding a new member or revoking a member, a process of removing anonymity of a signature, etc., it is possible to put a group signature with agreement of members without a reliable group representative. A decentralized group signature method according to the exemplary embodiment of the present invention has high utility in identification systems.

Hereinafter, the decentralized group signature method and an exemplary embodiment of applying the decentralized group signature method to a credential system will be described.

The decentralized group signature method according to the exemplary embodiments of the present invention will be described below.

The decentralized group signature method according to the exemplary embodiments of the present invention includes an initial system setup operation S110, an initial group member setup operation S120, a group member participation operation S130, a group signature operation S140, a group signature verification, operation S150, a group member anonymity removal operation S160, and a group member revoking operation S170.

In the initial system setup operation S110, elements of a group signature scheme and information which is generated in common by members in advance or generated and shared by the members in advance are defined.

The initial group member setup operation S120 indicates a process performed in advance by each group member for group signature, signature verification, participation, revoking, and the like after the initial system setup operation.

The group member participation operation S130 indicates a method performed when a new group member is added.

The group signature operation S140 indicates a method of putting a group signature on a specific message.

The group signature verification operation S150 indicates a method of verifying the group signature.

The group member anonymity removal operation S160 indicates a method of removing anonymity from a group signature for a specific group member with agreement of group members.

The group member revoking operation S170 indicates a method of revoking a specific group member with agreement of group members.

The initial system setup operation will be described below.

The group signature method according to the exemplary embodiment of the present invention is defined by the following settings, and values that group members know in common in an initial stage are assumed to be shared among the group members through an out-of-band path deviating from the range of the present invention.

n group members participate in group signature, and each group member M_(i) has a public key pair (τ_(i),y_(i)).

All the group members M_(i) are assumed to know the following in common so as to form a group in the initial stage.

n: the number of initial group members

t: a quorum required for agreement

y_(i): a public key of all the group members

N: a composite number N=p₁p₂=(2qp′₁+1)(2qp′₂+1) (p₁, p₂, p′₁, p′₂, q are all prime numbers)

g: a generator having a cyclic group q (i.e., g_(q)=1 mod N)

E_(k){ }, D_(k){ }: a symmetric key encryption algorithm and a symmetric key decryption algorithm (k is a symmetric key)

S_(sk){ }, V_(pk){ }: a signature algorithm and a signature verification algorithm ((sk, pk) is a public key pair)

H{ }: a hash function

COMM{ }: a commitment generation function

To form a group in the initial stage, all the group members M_(i) generate the following private and public values, and the public values are shared with one another.

Public key pair (τ_(i),y_(i))—an arbitrary private key τ_(i), and a public key y_(i)=g^(τ) ^(i) mod N

Identifier pair (ID_(i), X_(ID) _(i) )—an arbitrary private identifier ID_(i) and a public identifier X_(ID) _(i) =g^(ID) ^(i) mod N

The initial group member setup operation will be described below with reference to FIGS. 2 to 4.

The initial group member setup operation according to the exemplary embodiment of the present invention is an initial setup process in which each group member generates and combines polynomials for group signature, signature verification, participation, revoking, anonymity removal, and the like. The initial group member setup operation includes an operation of generating a polynomial of each group member, an operation of sharing polynomial verification data of each group member, an operation of sharing a polynomial value of each group member, an operation of combining polynomial and verification data of each group member, and an operation of verifying the combined polynomial.

Public parameters are X_(ID) ₁ , X_(ID) ₂ , y₁, y₂, COM₁, COM₂, y_(1,G), y_(2,G),

z_(1, αβ_(α, β ∈ [0, t − 1])), z_(2, αβ_(α, β ∈ [0, t − 1])), {v_(1, j)}_(j ∈ [0, t − 1]), and  {v_(2, j)}_(j ∈ [0, t − 1]).

In the operation generating a polynomial of each group member, a polynomial used for anonymity removal is generated according to Expression 1, and a polynomial used for signing is generated according to Expression 2.

f _(i)(x)=a _(i,0) +a _(i,1) x+ . . . +a _(i,t-1) x ^(t-1) mod q  [Expression 1]

a_(i,0)=ID_(i), and other coefficients (a_(i,1), . . . , a_(i,t-1)) are randomly extracted.

$\begin{matrix} {{f_{i}\left( {x,y} \right)} = {{\sum\limits_{\alpha = 0}^{t - 1}{\sum\limits_{\beta = 0}^{t - 1}{\rho_{i}\alpha\beta x^{\alpha}y^{\beta}\;{mod}\; q}}} = {k_{i,X_{{ID}_{i}}}(x)}}} & \left\lbrack {{Expression}\mspace{14mu} 2} \right\rbrack \end{matrix}$

ρ_(i)=K_(i) and is used later for verification.

In the operation of sharing polynomial verification data of each group member, a polynomial commitment value is generated according to Expression 3, a public parameter is generated according to Expression 4, and the public parameter is shared according to Expression 5.

COM_(i)=COMM{f _(i)(x)}  [Expression 3]

Expression 3 generates a polynomial commitment value for checking integrity of a polynomial later.

group public key portion: y _(i,G) =g ^(K) ^(i) mod N  [Expression 4]

for signature-related polynomial verification:

z _(i,αβ) ,z _(i,αβ) =g ^(ρ) ^(i,αβ) mod N for allρ^(i,αβ)∈[0,t−1]

for anonymity-removal polynomial verification:

v _(i,j) ,v _(i,j) =g ^(α) ^(i,j) mod N(j=0,1, . . . ,t−1), a _(i,j) is a coefficient of f _(i)(x)

Since a reliable organization is distributed, each group member generates a public parameter.

COM_(i) ,y _(i,G) ,z _(i,αβ) ,v _(i,j)→ALL  [Expression 5]

As mentioned above, since a reliable organization is distributed, each group member shares the public parameter thereof according to the exemplary embodiment of the present invention.

In the operation of sharing polynomial verification data of each group member, a result value is generated by inputting X_(ID) _(j) to the polynomial, which is generated by each group member, according to Expression 6 and transmitted, and each group member verifies received values according to Expression 7.

$\begin{matrix} \left. {E_{\lambda_{j}}\left\{ {{f_{i}\left( X_{{ID}_{j}} \right)},{k_{i,X_{{ID}_{j}}}(x)}} \right\}}\rightarrow M_{j \in {{\{{1,\ldots,n}\}}\backslash i}} \right. & \left\lbrack {{Expression}\mspace{14mu} 6} \right\rbrack \end{matrix}$

Expression 6 calculates a polynomial value with respect to the blind identifier of a group member.

$\begin{matrix} {g^{f_{i}{(X_{{ID}_{J}})}} = {\prod\limits_{k = 0}^{t - 1}\left( v_{i,k} \right)^{X_{{ID}_{j}}^{k}}}} & \left\lbrack {{Expression}\mspace{14mu} 7} \right\rbrack \end{matrix}$

mod N (and stored to open the identifier of M_(i))

$g^{k_{i,X_{{ID}_{j}}}{({ID}_{G})}} = {\sum\limits_{\alpha = 0}^{t - 1}{\sum\limits_{\beta = 0}^{t - 1}z_{i,{\alpha\beta}}^{{(X_{{ID}_{i}})}^{\alpha}{({ID}_{G})}^{\beta}}}}$

mod N, ID_(G) is the public identifier of the group

Since a reliable organization is distributed, a polynomial value is received from each group member and verified.

In the operation of combining polynomial and verification data of each group member, each group member combines received values according to Expression 8 to generate a common group parameter.

$\begin{matrix} {{{k_{i}(x)} = {\sum\limits_{j = 1}^{n}{{k_{j,X_{{ID}_{i}}}(x)}{mod}\; N}}}{y_{G} = {\prod\limits_{i = 1}^{n}{y_{i,G}{mod}\; N}}}} & \left\lbrack {{Expression}\mspace{14mu} 8} \right\rbrack \end{matrix}$ z _(αβ)=Π_(i=1) ^(n) z _(i,αβ) mod N for all i,αβ∈[0,t−1]

In the operation verifying the combined polynomial, the combined value of each member is verified according to Expression 9.

$\begin{matrix} {g^{k_{i}{({ID}_{G})}} = {\sum\limits_{\alpha = 0}^{t - 1}{\sum\limits_{\beta = 0}^{t - 1}{z_{\alpha\beta}^{{(X_{{ID}_{i}})}^{\alpha}{({ID}_{G})}^{\beta}}{mod}\; N}}}} & \left\lbrack {{Expression}\mspace{14mu} 9} \right\rbrack \end{matrix}$

The group member participation operation will be described below with reference to FIGS. 5 and 6.

The group member participation operation according to the exemplary embodiment of the present invention is a process in which a new group member shares data with each group member and generates and verifies a polynomial to participate in the group. The group member participation operation includes an operation of sharing data of each group member for participation of a new group member, an operation of generating a polynomial of the new group member, and an operation of verifying the polynomial of the new group member.

Public and shared parameters are y_(new), X_(ID) _(new) , y_(i), and X_(ID) _(i) .

In the operation of sharing data of each group member for participation of a new group member, the new group member requests participation in the group according to Expression 10, and responses are made by existing group members according to Expression 11.

M _(new):τ_(new) ,y _(new) :=g ^(τ) ^(new) ,ID _(new) ,X _(ID) _(new) :=g ^(ID) ^(new)

M _(new) →M _(i) :y _(new) ,X _(ID) _(new) ,f _(new)(X _(ID) _(i) ), etc.  [Expression 10]

X_(ID) _(new) :=g^(ID) ^(new) is a group member identifier for interoperation with an anonymous authentication system.

M _(t):τ_(i) ,y _(i) :=g ^(τ) ^(i) ,ID _(i) ,X _(ID) _(i) :g ^(ID) ^(i)

M _(new) ←M _(i) :y _(i) ,X _(ID) _(i) ,f _(i)(X _(ID) _(new) ),E _(λ) _(i) {k _(i)(x _(new))}, etc.  [Expression 11]

X_(ID) _(i) :=g^(ID) ^(i) is a group member identifier for interoperation with the anonymous authentication system.

In the operation of generating a polynomial of the new group member, when the new group member receives responses from t or more group members, the new group member generates a polynomial to be used by himself or herself as a group member according to Expression 12 and calculates c₀, . . . , c_(t-1) by solving simultaneous equations.

$\begin{matrix} {{{{\sum\limits_{\alpha = 0}^{t - 1}{c_{\alpha}\left( X_{{ID}_{i}} \right)}^{\alpha}} = {k_{new}\left( X_{{ID}_{i}} \right)}},{i = 1},2,\ldots\mspace{14mu},t}{{k_{new}(x)} = {\sum\limits_{\alpha = 0}^{t - 1}{c_{\alpha}x^{\alpha}}}}} & \left\lbrack {{Expression}\mspace{14mu} 12} \right\rbrack \end{matrix}$

In the operation of verifying the polynomial of the new group member, the new group member verifies the polynomial generated by himself or herself according to Expression 13 and specifies a group member who has given a wrong value according to Expression 14 when the verification fails.

$\begin{matrix} {{g^{c_{\alpha}} = {\prod\limits_{\beta = 0}^{t - 1}{\left( z_{\alpha\beta} \right)^{{(X_{ID_{new}})}^{\beta}}{mod}\; N\mspace{14mu}{for}\mspace{14mu}{all}}}}{c_{a} \in \left\lbrack {0,{t - 1}} \right\rbrack}} & \left\lbrack {{Expression}\mspace{14mu} 13} \right\rbrack \\ {g^{k_{i}{(X_{{ID}_{new}})}} = {\prod\limits_{\alpha = 0}^{t - 1}{\prod\limits_{\beta = 0}^{t - 1}{\left( z_{\alpha\beta} \right)^{{(X_{ID_{new}})}^{\alpha}{(X_{{ID}_{i}})}^{\beta}}{mod}\; N}}}} & \left\lbrack {{Expression}\mspace{14mu} 14} \right\rbrack \end{matrix}$

The group signature operation of putting a group signature on a specific message will be described below with reference to FIGS. 7 to 9.

The group signature operation includes an operation of generating individual data required for signing, an operation of verifying received individual data, an operation of generating a polynomial to be used in checking the number of members who have signed, an operation of combining the received individual data and signing a message, an operation of transmitting partial message signature data, and an operation of verifying received partial signature data and generating a signature value.

Public and shared parameters are y_(G) and {X_(ID) _(i) }_(i∈[0,n]).

In the operation of generating individual data required for signing, each group member selects, a random value according to Expression 15 generates individual signature data to constitute a signature according to Expression 16, and transmits the generated individual signature data to each group member according to Expression 17.

δ_(i),0<δ_(i) <q  [Expression 15]

r _(i) =g ^(δ) ^(i) mod N

σ_(i) =g ^(k) ^(i) ^((y) ^(G) ⁾mod N  [Expression 16]

(r ^(i),σ_(i) ,X _(ID) _(i) )→M _(j∈(1, . . . ,n)\i)  [Expression 17]

where X_(ID) _(i) is a group member identifier for interoperation with the anonymous authentication system.

In the operation of verifying received individual data, the received individual, data (r_(i), σ_(i), X_(ID) _(i) ) is verified according to Expression 18. When the verification fails, M_(i) is determined to have transmitted the wrong data (r_(i), σ_(i), X_(ID) _(i) ).

$\begin{matrix} {\sigma_{i} = {\prod_{\alpha = 0}^{t - 1}{\prod_{\beta = 0}^{t - 1}{\left( z_{\alpha\beta} \right)^{{(y_{G})}^{\alpha}{(X_{{ID}_{i}})}^{\beta}}\mspace{14mu}{mod}\mspace{14mu} N}}}} & \left\lbrack {{Expression}\mspace{14mu} 18} \right\rbrack \end{matrix}$

for σ_(i) ϵ[0, ι−1]

In the operation of generating a polynomial to be used in checking the number of signed members, a polynomial to be used in checking the number of signed members is generated according to Expression 19.

$\begin{matrix} {V_{i} = {g^{\sigma_{i}}{mod}\;{N\left( {{i = 1},\ldots\mspace{14mu},t} \right)}}} & \left\lbrack {{Expression}\mspace{14mu} 19} \right\rbrack \\ {{F(X)} = {\sum\limits_{i = 1}^{t}{X_{{ID}_{i}}{\prod\limits_{{i = 1},{j ≢ i}}^{t}{\frac{X - V_{j}}{V_{i} - V_{j}}{{mod}q}}}}}} & \; \end{matrix}$

In the operation of combining the received individual data and signing a message, the received individual data is combined according to Expression 20, and a message is signed according to Expression 21.

$\begin{matrix} {{R = {\prod\limits_{i = 1}^{t}{r_{i}{mod}\; N}}}{\lambda = {{F\left( y_{G} \right)}{mod}\; q}}{\omega = {R{\sum\limits_{\alpha = 0}^{t - 1}{\sum\limits_{i = 1}^{t}{X_{{ID}_{i}}^{\alpha}{mod}\; q}}}}}} & \left\lbrack {{Expression}\mspace{14mu} 20} \right\rbrack \end{matrix}$ u=H(m∥R∥λ∥ω), m is a message to be signed

s _(i)=δ_(i) −k _(i)(y _(G))Ru mod q  [Expression 21]

In the operation of transmitting partial message signature data, message signature data is transmitted according to Expression 22.

[s _(i),(V _(i) ,x _(i))]→M _(j∈(1, . . . ,t)\i)  [Expression 22]

In the operation of verifying received partial signature data and generating a signature value, received signature data is verified according to Expression 23, and a signature value is generated according to Expression 24.

$\begin{matrix} {{{F\;\left( V_{\; i} \right)}\; = \; X_{{ID}_{i}}}{g^{\; s_{\; i}} = \;{r_{i}{\prod\limits_{\alpha = 0}^{t - 1}{\prod\limits_{\beta = 0}^{t - 1}{\left( \; z_{\;{\alpha\;\beta}} \right)^{{- \;{(\; y_{G})}^{\alpha}}\;{(\; x_{i})}^{\beta}\; R\; u}\;{mod}\; N}}}}}{{{for}\mspace{14mu}{all}\mspace{14mu} i}\; = \left\lbrack {1,t} \right\rbrack}} & \left\lbrack {{Expression}\mspace{14mu} 23} \right\rbrack \\ {{s = {\sum\limits_{i = 1}^{t}\;{s_{i}{mod}\; q}}}\;{y_{\beta} = \;{R\;{\sum\limits_{i = 1}^{\; t}{X_{I\; D_{i}}^{\;\beta}{mod}\; q}}}}} & \left\lbrack {{Expression}\mspace{14mu} 24} \right\rbrack \end{matrix}$

signature data for the message m: (s, u, F (X), y_(β))

The group signature verification operation will be described below with reference to FIG. 10.

Public parameters are y_(G) and z_(αβ).

In the group signature verification operation, calculation is performed to verify a signature value according to Expression 25, and the signature for the message m is verified according to Expression 26.

$\begin{matrix} {{{\lambda = {{F\left( y_{G} \right)}{{mod}q}}},{\omega = {\sum\limits_{\beta = 0}^{t - 1}{y_{\beta}{mod}\; q}}}}{R^{\prime} = {g^{s}\left\{ {\prod\limits_{\alpha = 0}^{t - 1}{\prod\limits_{\beta = 0}^{t - 1}\left( z_{\alpha\beta} \right)^{{(y_{G})}^{\alpha}{(y_{\beta})}u}}} \right\}{mod}\; N}}} & \left\lbrack {{Expression}\mspace{14mu} 25} \right\rbrack \\ {u = {H\left( {m{{{R^{\prime}}{\lambda }}}\omega} \right)}} & \left\lbrack {{Expression}\mspace{14mu} 26} \right\rbrack \end{matrix}$

When the above expression holds true, the signature (s, u, F (X), y_(β)) is valid.

The group member anonymity removal operation will be described below with reference to FIG. 11.

The following is a process of removing anonymity of a specific group member through a quorum t of members required for agreement or more. A shared parameter is {X_(ID) _(i) }_(i∈[0,n]).

In the group member anonymity removal operation, X_(ID) _(i) of an abnormal group member is shared, and managers share f_(i)(X_(ID) _(i) ) received from X_(ID) _(i) with one another.

When t or more polynomial values are received, each manager recovers a polynomial from the received polynomial values and then verifies the recovered polynomial according to Expression 27.

$\begin{matrix} {{{L(x)}:={\sum\limits_{j = 0}^{t}{{f_{i}\left( X_{{ID}_{j}} \right)}{\ell_{j}(x)}}}}{{{Check}\mspace{14mu}{COM}_{i}} = {?{{COMM}\left\{ {L(x)} \right\}}}}{{\ell_{j}(x)}:={\overset{k}{\prod\limits_{{i = 0},{i \neq j}}}\frac{x - x_{i}}{x_{j} - x_{i}}}}} & \left\lbrack {{Expression}\mspace{14mu} 27} \right\rbrack \end{matrix}$

According to Expression 28, the recipient identifier ID, is checked through the recovered polynomial.

$\begin{matrix} {{{ID}_{i}\text{:}\mspace{14mu}{L(0)}}:={\overset{t}{\sum\limits_{j = 0}}{{f_{i}\left( X_{ID_{j}} \right)}{\ell_{j}(x)}}}} & \left\lbrack {{Expression}\mspace{14mu} 28} \right\rbrack \end{matrix}$

The group member revoking operation will be described below with reference to FIG. 12.

The group member revoking operation is a process of revoking a group member disclosed through group member anonymity removal. Public parameters are {X_(ID) _(i) , V_(i)}_(i∈[0,n] and a revoking member list (RML).)

In the group member revoking operation, t or more group members sign a revoking member list (ID_(l) is acquired in the above-described group member anonymity removal operation) according to Expression 29, and a value used by the member to be revoked is checked by the group members who have signed the RML according to Expression 30.

signature message: v _(l) ∥X _(ID) _(l) ∥ID _(l)  [Expression 29]

included in RML

X_(ID) _(l) is a group member identifier for interoperation with the anonymous authentication system.

$\begin{matrix} {{{{Find}\mspace{14mu}{F\left( V_{l} \right)}} = X_{{ID}_{l}}}{g^{s_{i}} = {r_{i}{\prod\limits_{\alpha = 0}^{t - 1}{\prod\limits_{\beta = 0}^{t - 1}{\left( z_{\alpha\beta} \right)^{{- {(y_{G})}^{\alpha}}{(X_{{ID}_{i}})}^{\beta}u}{mod}\; N}}}}}} & \left\lbrack {{Expression}\mspace{14mu} 30} \right\rbrack \end{matrix}$

The configuration of a credential system which employs the above-described decentralized group signature method to provide issuer anonymity will be described below.

The protocol of the anonymous authentication system, which is obtained by applying the decentralized group signature method to the IdeMix protocol, will be described below. According to the exemplary embodiment of the present invention, the validity of a credential is verified by proving values with which group members blindly sign the identifier of another group member who issues the credential.

1. The outline of an anonymous authentication system application method will be described below.

The anonymous authentication system according to the exemplary embodiment of the present invention includes logic for an initial recipient to verify a group member.

An issuer transmits an

value thereof, related signature information, knowledge proof data, etc. to a recipient, and the recipient verifies the validity of the issuer by verifying the corresponding value.

According to the exemplary embodiment of the present invention, the recipient designates related information as attribute values to allow a verifier to verify the validity of the issuer later.

m₁

(the blind identifier of the issuer)

m₂:

_(s) (a signature for the blind identifier)

m₃:SN (a serial number which is used later when it is necessary to identify a credential with a serial number)

m₄: Time (a timestamp for recording an update time point)

m₅: master secret key (a recipient identifier)

According to the exemplary embodiment of the present invention, the issuer verifies the message values m₁ to m₄ and issues a credential, and a verifier verifies the validity of the issuer by verifying the message values thereafter.

According to the exemplary embodiment of the present invention, valid group members serve as the issuer of the anonymous authentication system by proving values, with which the valid group members signed a blind identifier of a group member, to participants in the anonymous authentication system.

As a process to be performed before issuance of an anonymous credential, the issuer M_(i) is required to receive valid signatures for the blind value

_(l) of ID_(i) which is the identifier of the issuer n (it is possible to set a signature processing option to use

only once).

A pair of keys to be used in the anonymous credential system is generated.

The recipient verifies whether a group member is a valid group member and generates a knowledge proof value for an attribute which will not be disclosed, among attributes to be authenticated.

The issuer verifies attribute values received from the recipient and issues a credential for private attribute values and public attribute values.

As a task before the credential is provided to a verifier, the recipient randomizes the credential, generates proof data for the private attributes, and provides the credential, to a verifier.

The verifier checks that the credential has been generated by a valid group member, verifies the validity of the credential, and checks necessary attribute values.

The exemplary embodiment of the present invention has a technical characteristic that an, operation of verifying that a credential issuer corresponds to group members is added as a change when, group signature is adopted to ensure issuer anonymity.

As a blind identifier signature processing option according to the exemplary embodiment of the present invention, a real-time signature processing scheme (option 1) is described.

A group member participation process is performed as a preceding task, and every time a blind identifier is additionally required, a group signature process is repeated to generate a blind identifier.

In the case of issuing a credential to a recipient using a zero-knowledge proof for the blind identifier, a new blind identifier is generated for a next recipient's signature, and a group member who receives the blind identifier signs a corresponding value and transmits the corresponding value to other group members so that a valid signature may be generated according to a threshold signature policy.

When valid signature values are generated for blind identifiers by group members, a credential is issued to the recipient using the valid signature values.

As a blind identifier signature processing option according to the exemplary embodiment of the present invention, a batch signature processing scheme (option 2) is described.

A group member participation process is performed as a preceding task, and a group signature process is performed at a predetermined specific time point which is determined in advance through agreement.

In this case, a large number of blind identifiers to be used for credential issuance are generated and transferred to group members at an arbitrary time, and the group members who receive the blind identifiers sign a corresponding value and transmit the corresponding value to other group members so that a valid signature may be generated according to a threshold signature policy.

When valid signature values are generated for the blind identifiers by the group members, a credential is issued to a recipient using the valid signature values.

Referring to FIGS. 13 and 14, a protocol flow in the anonymous authentication system will be described.

Referring to FIG. 13, the outline of input values of participants in the issuance protocol of IdeMix is shown, and an issuer and a recipient may have different attribute values.

In particular, the issuer cannot have any knowledge about secret data, and group and system parameters can be accessed through references given to a credential struct.

Referring to FIG. 14, most input values to a proving protocol are proof specifications.

A proof specification is connected to a credential of a prover and is also connected to a credential struct of a verifier.

The verifier obtains a proof specification as a cryptographic secret output, object which may be used in an application-specific task such as an issuance protocol.

2. Notation of the anonymous authentication system application method will be described below.

Notation related to group signature is described below.

group member set (group manager as well): M

group member identifier (secret data): ID

public group identifier: ID_(G)

external group-member identifier public):

commitment value: COM

polynomial value: f(x)

notation related to i^(th) group member: M_(i)ID_(L),

, COM_(i), f_(i)(x), etc.

group signature:

_(s)

Parameters related to the anonymous authentication system and the descriptions thereof are shown in FIG. 15, and the sizes of the parameters related to the anonymous authentication system are shown in FIG. 16.

In addition, Time is a timestamp, SN is a serial number, and context is a list of all public parameters and public keys of issuers.

3. A credential issuance procedure (issuer and recipient) and a credential issuance protocol of the anonymous authentication system application method will be described below.

Input commons are

, {nym}, {dNym}, {C_(k)}_(∀k∈A) _(c) , and {m_(i)}_(∀i∈A) _(k) .

A recipient is m₅, {(m_(k), r_(k))}_(k∈A) _(c) , {m_(j)}_(∀j∈A) _(h) , and {r_(i)}_(∀i∈{nym}).

An issuer is sk and group signature information.

As an output common, ⊥ is returned when a Camenisch-Lysyanskaya (CL) signature (A, e, v) or protocol fails.

is an issuance specification.

{nym} is a pseudonym, nym≡g^(m) ^(s) h^(r) (mod Γ), and m₅=master secret key.

{dNym} is a domain pseudonym, and dNym≡g_(dom) ^(m) ^(k) (mod Γ).

{C_(k)} is a commitment, and C_(k)≡±Z_((k)) ^(m) ^(k) S_((k)) ^(r) ^(k) (mod n_((k)c)).

{m_(i)} is a message.

Round 0

Round 0 is a procedure for authenticating a group member and is also an operation in which a recipient or verifier verifies that an issuer is a valid group member while issuer anonymity is ensured.

The point is to verify whether a group signature has been put on a corresponding blind identifier and zero-knowledge proof for the blind identifier of the issuer.

The verification is intended to prove that a quorum of group members agree with the blind identifier of the recipient and is intended for the issuer who actually issues a credential to check that the recipient is the owner of the blind identifier.

0.1 Recipient: n₁∈_(R) {0,1}*

0.2 Issuer←recipient: n₁

0.3 Issuer: Timestamp Time, SerialNumber SN∈_(R) {0,

, c=H(Time∥SN∥

_(s)∥

∥n₁), and n₂∈_(R){0,1}*

0.4 Issuer→recipient: Time, SN,

_(s),

,

, c, and n₂

0.5 Recipient: verifies the following:

-   -   the group signature value         _(s) with respect to     -   whether the issuer knows a discrete logarithm value of         (         )     -   whether the issuer has generated c using values sent by the         recipient

0.6 Issuer and recipient: call the attribute struct A from S

Round 1

1.1 Recipient: ∈_(R) {0,

1.2 Recipient: U:=S^(v′)Π_(j∈A) _(h) R_(j) ^(m) ^(j) mod n (m₁=

, and m₁ is always exposed)

In m₁=

, the recipient inserts the blind identifier of a group member to his or her attribute so that a verifier may verify the validity of the issuer later, and the issuer verifies whether a blind identifier used by the issuer has an attribute value at the corresponding position.

1.3 Recipient: non-interactive proof

1.3.0.1 {tilde over (m)}_(j)∈_(R) {0,1

for j∈{5∪A_(h)∪A_(c)}

1.3.0.2 (Knowledge proof of pseudonym and master secret key) In the case of nym≠⊥, nym is set to {tilde over (r)}_(i)∈_(R) [1, ρ], and

:=g^({tilde over (m)}) ^(s) h^({tilde over (r)}) ^(i) mod Γ is calculated. Otherwise, it is set that

=⊥.

1.3.0.3 (Knowledge about domain pseudonym and master secret key) In the case of dNym≠⊥,

:=g_(dom) ^({tilde over (m)}) ^(s) mod τ is calculated. Otherwise, it is set that

:=⊥.

1.3.1 (Knowledge proof of representation of U′)

{tilde over (v)}′∈_(R)±{0,

is selected, Ũ:=S^({tilde over (v)}′)Π_(j∈A) _(h) R_(j) ^({tilde over (m)}) ^(i) mod n is calculated, and then all random values are stored

1.3.2 (Knowledge proof of commitment value)

{tilde over (r)}_(j)∈_(R) {0,

is selected, an

${\overset{\sim}{C}}_{j}:=\left( {Z_{(j)}^{{\overset{\sim}{m}}_{j}}S_{(j)}^{{\overset{\sim}{r}}_{j}}\;{mod}\; n_{(j)}} \right)_{j \in A_{c}}$

is calculated

1.3.3 (Challenge value)

c:=H(context∥U∥C ₁ ∥ . . . ∥C _(k) ∥nym∥dNym∥Ũ∥{tilde over (C)} ₁ ∥ . . . ∥{tilde over (C)} _(k) ∥

∥

∥n ₂)

1.3.4 (Response value)

{circumflex over (v)}′:={tilde over (v)}′+cv′

S _(A):=({circumflex over (m)} _(j) :={tilde over (m)} _(j) +cm _(j))_(j∈A) _(h)

In the case of nym≠⊥, ({circumflex over (r)}_(j):={tilde over (r)}_(j)+cr_(j) mod ρ)_(j∈{nym}) is calculated. Otherwise, it is set that {circumflex over (r)}:=⊥.

1.3.5 (Output)

P ₁:=(c,{circumflex over (v)}′,S _(A) ,{circumflex over (r)})

1.4 Issuer←recipient: U, P₁, and n₃∈_(R)±{0,

1.5 The recipient stores A_(k) (the value and the struct), v′, and context in a file (used for a credential update)

Round 2 (Signature Generation)

2.1 The issuer verifies P₁.

2.1.0.1 (Knowledge proof of pseudonym and master secret key) In the case of nym≠⊥, nŷm:=nym^(−c)g^({circumflex over (m)}) ^(s) h^({circumflex over (r)}) mod Γ is calculated. Otherwise, it is set that nŷm:=⊥.

With regard to nŷm:=nym^(−c)g^({circumflex over (m)}) ^(s) h^({circumflex over (r)}) mod Γ, the index number of an attribute value for ensuring the anonymity of the recipient is changed due to attribute values used for verifying a group member, and a pseudonym value is set in {circumflex over (m)}₁ in the original scheme.

2.1.0.2 (Knowledge proof of domain pseudonym and master secret key) In the case of dnym≠⊥, d{circumflex over (N)}ym:=dNym^(−c)g_(dom) ^({circumflex over (m)}) ^(s) mod Γ is calculated.

2.1.1 (Representation of U)

Û:=U ^(−c)(S ^(v) ^(i) Π_(j∈A) _(h) R _(j) ^({circumflex over (m)}) ^(j) mod n

2.1 The issuer verifies P₁.

2.1.2 (Knowledge proof of commitment value) In the case of dnym≠⊥, Ĉ_(j):=(c_(j) ^(−c)Z_((j)) ^({circumflex over (m)}) ^(j) S_((j)) ^({circumflex over (r)}) ^(j) mod n_((j)))_(j∈A) _(c) is calculated.

2.1.3 (Verification)

ĉ:=H(context)∥U∥C ₁ ∥ . . . ∥C _(k) ∥nym∥dNym∥Û∥Ĉ ₁∥] . . . ∥Ĉ _(k) ∥nŷm∥d{circumflex over (N)}ym∥n ₂)

In the case of ĉ≠c, the verification fails. The credential issuance protocol is terminated, and ⊥ is returned.

2.1.4 (Length check)

{circumflex over (v)}′∈±{,

,

m _(i)∈±{0,

for all i∈{5∪A _(h) ∪A _(c)}

When the length check fails, the credential issuance protocol is terminated, and ⊥ is returned.

2.2 The issuer generates a CL signature for attributes.

2.2.1 A random prime number is selected.

e∈ _(R)[

,

,+

]

2.2.2 A random integer is selected, and {tilde over (v)}∈E_(R){0,

and v″:=

+{tilde over (v)} are calculated.

2.2.3 It is designated that m₁=

, and then the following is calculated.

$Q:=\frac{Z}{{{US}^{v^{''}}}_{\prod_{i \in A_{k}}}R_{\;_{\;_{i}}}^{m_{i}}}$

mod n and A:=Q^(e) ⁻¹ ^(mod p′q′) mod n

(A, e, v″) is transmitted to the recipient.

With regard to m₁=

, a signature is generated with the blind identifier of the credential issuer added to attribute No. 1, and the signature is used later as a base for a verifier in the anonymous authentication system to determine the validity of the issuer.

2.2.4 The issuer stores Q, A_(k) (the value and the struct), v″, and context in a file (used for a credential update)

2.3 The issuer generates a proof of correctness as follows:

SPK{(e ⁻¹):A≡±Q ^(e) ⁻¹ (mod n)}(n ₃).

2.3.1 Ã:=Q^(r) (mod n) corresponding to r∈_(R)

*_(p′q′) is calculated.

2.3.2 c′:=H(context∥Q∥A∥Ã∥n₃) is calculated.

2.3.3 s_(e):=r−c′e⁻¹ (mod p′q′) is calculated. The proof is P₂←(S_(e), c′).

2.4 Issuer→recipient: (A, e, v″),P₂, and (m_(t))_(i∈A) _(k)

Round 3

3.1 v:=v″+v′ is calculated.

3.2 The recipient verifies (A, e, v) using a CL signature verification algorithm.

3.2.1 Whether e is a prime number is checked, and e∈[

,

+

] is verified.

3.2.2 It is set that m₁:=

, and

$Q:=\frac{Z}{{S^{v}}_{\prod_{i \in S}}R_{\;_{\;_{i}}}^{m_{i}}}$

mod n is calculated.

With regard to m₁:=

, the recipient inserts the blind identifier of a group member to his or her attribute so that a verifier may verify the validity of the issuer later.

3.2.3 {circumflex over (Q)}:=A^(e) mod n is calculated.

3.2.4 In the case of Q≢{circumflex over (Q)} (mod n), the credential issuance protocol is terminated.

3.3 The recipient verifies P₂.

3.3.1 Â:=A^(c′) Q^(S) ^(e) mod n is calculated.

3.3.2 ĉ:=H(context∥Q∥A∥Â∥n₃) is calculated.

3.3.3 In the case of ĉ≠c′, the credential issuance protocol is terminated.

3.4 (Output) When operations 3.2 and 3.3 are successful, the credential (m_(i))_(i∈A), (A, e, v) is stored.

4. A credential update procedure (issuer and recipient) of the anonymous authentication system application method will be described below.

Round 1

1.1 (m _(i))_(A) _(k) is an attribute value of a credential to be updated.

1.2 Δm_(i)=m _(i)−m_(i)

1.3 The issuer loads a previously stored object from an update file.

1.4 The issuer generates a CL signature for the attribute.

1.4.1 A random prime number is selected.

e∈ _(R)[

,

+

]

1.4.2 The random integer {tilde over (v)}∈_(R) {0,

is selected, and v″:=

+{tilde over (v)} and Δv″:=v″+v″ are calculated.

1.4.3

$\overset{\_}{Q}:=\frac{Q}{\left( {\prod_{i \in A_{k}}R_{i}^{\Delta\; m_{i}}} \right)s^{\Delta\; v^{''}}}$

mod n and Ā:=Q ^(e) ⁻¹ ^(mod p′q′) mod n are calculated.

1.4.4 It is set that Q:=Q, v″:=v″, m_(i):=m _(i), and A:=Ā.

1.5 The issuer generates the following proof of correctness:

P ₂:=SPK{(e ⁻¹):A≡±Q ^(e) ⁻¹ (mod n)}(n ₃).

1.7 The issuer sends (A, e, v″), P₂ and (m_(i))_(i∈A) _(k) to the recipient.

1.7 The issuer updates the file with objects such as Q, v″, and {m_(i): i∈A_(k)} (used for a credential update)

Round 2

2.1 The recipient loads a previously stored object from an update file.

2.2 The recipient verifies P₂.

2.2.1 Q and {circumflex over (Q)}=A^(c′) Q^(S) ^(e) are calculated.

2.2.2 ĉ=H(context∥Q∥A∥{circumflex over (Q)}∥n₃ is calculated.

2.2.3 In the case of ĉ≠c′, the credential issuance protocol is terminated.

2.3 The recipient calculates v=v′v″ and stores the calculation result.

2.4 The recipient verifies (A, e, v) using a CL signature verification algorithm.

2.4.1 Whether e is a prime number is checked, and e∈[

,

+

] is verified.

2.4.2 Z≡A^(e)R₁ ^(m) ¹ . . . R_(l) ^(m) ^(i) S^(v)(mod n) is verified.

2.5 When operations 2.2 and 2.4 are successful, the credential (m₁, . . . , m_(l), (A, e, v)) is output, and the recipient updates the corresponding record for this credential.

5. A proof data generation procedure (recipient) of the anonymous authentication system application method will be described below.

A proof data verification method includes an operation of implementing all sub-protocols (a CL signature proving protocol, an AND operation proof generation protocol, etc.) along with execution of a proof generation protocol to calculate a value corresponding to a T value of the protocol, an operation of generating a challenge (c) value, an operation of calculating S values of all the sub-protocols using the c value, and an operation of transmitting the proof data to a verifier.

A protocol for generating a proof will be described below Inputs are m₅, {cred},

, {comm}, {rep}, {nym}, {dNym}, {verEnc}, and {msg}, and outputs are non-interactive proofs of a condition present in

: (Common, c, s).

{cred} is a credential, {comm} is a commitment, {rep} is a representation, {nym} is a pseudonym, {dNym} is a domain pseudonym, {verEnc} is verifiable encryption, {msg} is a message,

is a set of predicates specified in

,

is a set of exposed identifiers,

is a set of unexposed identifiers, and n₁ is a nonce generated by a verifier.

0. Setup

0.1 {circumflex over (v)}_(i)({tilde over (m)}_(i))∈_(R) {0,

is generated for each hidden identifier v_(i)∈V_(h), and the generated values are stored in each identifier.

1. A t value is calculated.

1.1 Each p in

calls an appropriate sub-proving protocol. Each sub-proving protocol accesses the list T to store a t value and accesses the list Common to store a common value. The sub-proving protocol may access a random value generated in operation 0.1. In the present invention, it is assumed that a partial protocol is maintained in a state until the proof is finished (until the t and s values end).

2. A challenge is calculated.

2.1 The challenge c:

c:=H(context,Common,T,{comm},{rep},{nym},{dNym},{verEnc},{msg},n ₁)

3. A response is calculated.

3.1 Each predicate p∈

calls an appropriate sub-proving protocol. The sub-proving protocol outputs the s value as necessary. The s value is indexed with a predicate or identification name.

4. Proof data is output.

4.1 Proof data (c, s, Common) is output. When s and S are given, a verifier may easily determine a correct s value to use the struct of s in a verification period.

The CL signature proving protocol will be described below.

The CL signature proving protocol proves a credential owned by the protocol to be valid with the credential randomized.

Inputs are cred, CLPredicate p, and [c]. As for outputs, one t value and a common value A′ are output in the case of c=⊥, and otherwise, three s values are output.

1. A signature is randomized.

1.1 r_(A)∈_(R) {0,

1.2 A CL signature is randomized as follows. A randomized signature value is (A′, e, v′).

A′:=AS ^(T) ^(A) (mod n)

v′:=v−er _(A) (in

)

Additionally, e′:=e−

is calculated.

2. A t value is calculated.

2.1 {tilde over (e)}∈E_(R) {0

, {tilde over (v)}′∈_(R) {0,

2.2 A random value {tilde over (m)}_(i) corresponding to each identifier i∈

_(F) is recovered.

$\overset{\sim}{Z}:={\left( A^{\prime} \right)^{\overset{\sim}{e}}\left( {\prod\limits_{i \in {\mathfrak{J}}_{\overset{\_}{r}}}R_{i}^{\overset{\sim}{m_{i}}}} \right)\left( S^{{\overset{\sim}{v}}^{\prime}} \right)\mspace{20mu}{mod}\;{n.}}$

3. The t value {tilde over (Z)} and the common value A′ are output.

4. s values are calculated. The following is calculated within a

range.

4.1 ê:={tilde over (e)}+ce′(={tilde over (e)}+c(e−

))

4.2 {circumflex over (v)}′:={tilde over (v)}′+cv′

4.3 {circumflex over (m)}_(i):={tilde over (m)}₁+cm_(i) for i∉

_(r)

An AND operator proof generation protocol will be described below.

Inputs are PrimeEncodePredicate p (with AND operator) and [c]. As for outputs, two t values and a common value are output in the case of c=⊥, and otherwise, two s values are output.

1. m is committed (commitment calculation).

1.1 r∈E_(R) {0,

1.2 C=Z^(m)S^(r) (mod n)

2. t values are calculated.

2.1 A random integer is selected.

{acute over (m)} _(h)∈_(R)±{0,

, {tilde over (r)}∈ _(R)±{0,

2.2 The following is calculated.

{tilde over (C)}=(Z ^(m) ^(r) )^({tilde over (m)}) ^(h) ^(S) ^({tilde over (r)}) (mod n)

{tilde over (C)} ₀ :=Z ^({tilde over (m)}) S ^({tilde over (r)})

3. The t values {tilde over (C)} and {tilde over (C)}₀ and the common value C are calculated.

4. S values are calculated. The following is calculated within a

range.

4.1 {circumflex over (m)}_(h):={tilde over (m)}_(h)+cm_(h)

4.2 {circumflex over (r)}:={tilde over (r)}+cr

A NOT operator proof generation protocol will be described below.

Inputs are PrimeEncodePredicate p (with the NOT operator) and [c]. As for outputs, one t value and a common value are output in the case of c=⊥, and otherwise, three s values are output.

1. m is committed, and an exponent is calculated.

1.1 r∈_(R) {0,

1.2 C=Z^(m)S^(r) (mod n)

1.3 {tilde over (m)}, {tilde over (r)}∈_(R)±{0,

1.4 a and b are calculated to satisfy ma+m_(r)b=1.

1.5 r′:=ra

2. A t value is calculated.

2.1 {tilde over (r)}′, ã, {tilde over (b)}∈_(R)±{0,

2.2 {tilde over (C)}:=C^(ã)(Z^(m) ^(r) )^({tilde over (b)})S^({tilde over (r)}′) (mod n)

3. The t value {tilde over (C)} and the common value C are output.

4. s values are calculated and output. The following is calculated within a

range.

4.1 {circumflex over (r)}′:={tilde over (r)}′+cr′

4.2 â:=ã+ca

4.3 {circumflex over (b)}:={tilde over (b)}+cb

An inequality proof generation protocol will be described below. This is a proving protocol for <, ≤, > and ≥ operators.

Inputs are InequalityPredicate p and [c]. As for outputs, six t values and five common values are output in the case of c=⊥, and otherwise, ten 3 values are output.

1. Proof setup

1.1 Definition

$\Delta:=\left\{ {{\begin{matrix} {b - m} & {{{if}\mspace{14mu}*} \equiv \leq} \\ {b - m - 1} & {{{if}\mspace{14mu}*} \equiv <} \\ {m - b} & {{{if}\mspace{14mu}*} \equiv \geq} \\ {m - b - 1} & {{{if}\mspace{14mu}*} \equiv >} \end{matrix}{and}a}:=\left\{ \begin{matrix} {- 1} & {{{if}\mspace{14mu}*} \equiv \leq \mspace{14mu}{or}\mspace{14mu} <} \\ 1 & {{{if}\mspace{14mu}*} \equiv \geq \mspace{14mu}{or}\mspace{14mu} >} \end{matrix} \right.} \right.$

When conditional expressions hold true, Δ is represented as a positive number. Therefore, in the case of Δ<0, the proof is considered to be failed, and ⊥ is returned.

1.2 Δ is represented as the sum of four squares.

Δ:=u ₁ ² +u ₂ ² +u ₃ ² +u ₄ ²

1.3 r_(i)∈_(R) {0,

is selected, and the following is calculated.

$\begin{matrix} {T_{1}:={Z^{u_{1}}{S^{r_{1}}\left( {{mod}\; n} \right)}}} \\ {T_{3}:={Z^{u_{3}}{S^{r_{3}}\left( {{mod}\; n} \right)}}} \\ {T_{\Delta}:={Z^{\Delta}{S^{r_{\Delta}}\left( {{mod}\; n} \right)}}} \end{matrix}\mspace{31mu}\begin{matrix} {T_{2}:={Z^{u_{2}}{S^{r_{2}}\left( {{mod}\; n} \right)}}} \\ {T_{4}:={Z^{u_{4}}{S^{r_{4}}\left( {{mod}\; n} \right)}}} \end{matrix}$

Then, r_(Δ), r^(i), T^(Δ), and T_(i) are calculated.

2. t values are calculated.

2.1 ũ_(i)∈_(R) {0,

and {tilde over (r)}_(i), {tilde over (r)}_(Δ)∈_(R) {0,

are selected, and the following is calculated

$\begin{matrix} {{\hat{T}}_{1}:={Z^{{\overset{\sim}{u}}_{1}}{S^{{\overset{\sim}{r}}_{1}}\left( {{mod}\; n} \right)}}} \\ {{\hat{T}}_{3}:={Z^{{\overset{\sim}{u}}_{3}}{S^{{\overset{\sim}{r}}_{3}}\left( {{mod}\; n} \right)}}} \\ {{\hat{T}}_{\Delta}:={{Z^{\overset{\sim}{m}}\left( S^{a} \right)}^{{\overset{\sim}{r}}_{\Delta}}\left( {{mod}\; n} \right)}} \end{matrix}\mspace{31mu}\begin{matrix} {{\hat{T}}_{2}:={Z^{{\overset{\sim}{u}}_{2}}{S^{{\overset{\sim}{r}}_{2}}\left( {{mod}\; n} \right)}}} \\ {{\hat{T}}_{4}:={Z^{{\overset{\sim}{u}}_{4}}{S^{{\overset{\sim}{r}}_{4}}\left( {{mod}\; n} \right)}}} \end{matrix}$

{tilde over (m)} is a random value shared among sub-proving protocols.

2.2 {tilde over (α)}∈_(R) {0,

is selected, and the following is calculated.

Q:=T ₁ ^(ũ) ¹ T ₂ ^(ũ) ² T ₃ ^(ũ) ³ T ₄ ^(ũ) ⁴ S ^({tilde over (α)})(mod n)

2.3 The t values are output: {circumflex over (T)}₁, . . . {circumflex over (T)}₄, {circumflex over (T)}_(Δ), and Q

2.4 Output commons: T₁, . . . , T₄, and T_(Δ)

3. s values are calculated.

3.1 With respect to i∈{1,2,3,4},

û _(i) :=ũ _(i) +cu _(i),

3.2 {circumflex over (r)}_(i):={tilde over (r)}_(i)+cr_(i),

3.3 {circumflex over (r)}_(Δ):={tilde over (r)}_(Δ)+cr_(Δ), and

3.4 α:=r_(Δ)−Σ_(j=1) ⁴u_(j)r_(j) are calculated, and {circumflex over (α)}:={tilde over (α)}+cα is output.

A commitment proof generation protocol will be described below.

Inputs are comm, CommitmentPredicate p, and [c]. As for outputs, one t value is output in the case of c=⊥, and otherwise, one s value is output.

The commitment comm is represented as C:=R₁ ^(a) ¹ R₂ ^(a) ² . . . R_(L) ^(a) ^(L) S^(r). R_(i) and S are public keys of an issuer, and a₁, . . . , and a_(L) are commit values.

1. A t value is calculated.

1.1 A random integer is selected.

{tilde over (r)}∈ _(R)±{0,

1.2 {tilde over (m)}_(i) is a value selected in the proof generation operation 0.1, and the following is calculated.

$C^{\prime}:={\left( {\prod\limits_{i \in {\mathfrak{J}}_{\overset{\_}{r}}}R_{i}^{{\overset{\sim}{m}}_{i}}} \right){S^{\overset{\sim}{r}}\left( {{mod}\; n} \right)}}$

2. A response value is calculated.

2.1 Calculation is performed within a

range, and {circumflex over (r)}:={tilde over (r)}+cr is output.

A representation proof generation protocol will be described below.

Inputs are rep, RepresentationPredicate p, and [c]. As for outputs, one t value is output in the case of c=⊥, and otherwise, one s value is output.

1. The following values are calculated, and a t value is output. {tilde over (R)}=Πg_(j) ^({tilde over (m)}) ^(j) is calculated with respect to all j of x_(j) corresponding to a hidden identifier.

As for a representation, bases of commitment generally include a public key, but when the corresponding base is randomly selected, the base is referred to as a representation.

A pseudonym/domain pseudonym proof generation protocol will be described below.

Inputs are nym and/or dNym, NymPredicate and/or DomNymPredicate p, and [c]. As for outputs, one t value is output in the case of c=⊥, and otherwise, one s value is output.

1. A t value is calculated.

1.1 A random integer value is selected.

{tilde over (r)}∈ _(R)

_(ρ)

1.2 The following is calculated with respect to the value {tilde over (m)}₅ selected in the proof generation operation 0.1.

n{tilde over (y)}m:=g ^({tilde over (m)}) ^(s) h ^({tilde over (r)})(mod Γ) if nym≠⊥ and

dÑym:=g _(dom) ^({tilde over (m)}) ^(s) (mod γ) if dNym≠⊥

(The index numbers of attribute values including pseudonym information of a recipient are changed to attribute values used for issuer verification)

2. An s value is generated and output.

{circumflex over (r)}:={tilde over (r)}+cr(mod

)

A verifiable encryption proof generation protocol will be described below. This is a proving protocol for attribute-verifiable encrypted values.

Inputs are verEnc, VerEncPredicate p, and [c]. As for outputs, three t values are output in the case of c=⊥, and otherwise, one s value is output.

1. t values are calculated.

1.1 A random integer value is selected.

{tilde over (r)}∈R±{0,

1.2 The following is calculated.

û:=g ^(2{tilde over (r)}) , ê:=y ₁ ^(2{tilde over (r)}) h ^(2{tilde over (m)}) and {circumflex over (v)}:=(y ₂

)^(2{tilde over (r)})

1.3 The t values are output: û, ê, and {circumflex over (v)}

2. An s value is calculated: {circumflex over (r)}:={tilde over (r)}+cr

The predicate p includes a public key.

Ciphertext (u, v, e) and a random value r are loaded by a prover.

6. A proof verification procedure (verifier) of the anonymous authentication system application method will be described below.

A proof verification protocol will be described below. This is an algorithm for verifying a proof received from a recipient.

Inputs are S, P=(c, s, Common), and n₁, and an output is the approval or rejection of P.

1. A {circumflex over (t)} value is calculated.

1.1 Each predicate p∈

calls an appropriate sub-verification protocol. Each sub-verifier accesses the list {circumflex over (T)} to store an appropriate common value and the {circumflex over (t)} value from Common. The sub-verification protocol may access s values.

2. A verification challenge is calculated.

2.1 c:=H(context, Common, {circumflex over (T)}, {comm}, {rep}, {nym}, {dNym}, {verEnc}, {msg}, n₁)

3. It is checked whether challenge values are identical to each other.

3.1 In the case of c=ĉ, P is approved, and otherwise, P is rejected.

A CL signature data verification protocol will be described below.

This is a protocol for checking that a credential received from a recipient is a valid credential.

Inputs are a credential struct and CLPredicate p, and an output is one value.

1. Calculation is performed as follows.

$\hat{T}:={\left( \frac{Z}{\left( {\prod_{i \in {\mathfrak{J}}_{r}}R_{i}^{m_{i}}} \right)\left( A^{\prime} \right)^{{2\ell_{e}} - 1}} \right)^{- c}\left( A^{\prime} \right)^{\hat{e}}\left( {\prod\limits_{i \in {\mathfrak{J}}_{\overset{\_}{r}}}R_{i}^{{\hat{m}}_{i}}} \right)S^{{\hat{v}}^{\prime}}\mspace{14mu}{mod}\; n}$

2. A length is verified.

{circumflex over (m)} _(i)∈±{0,

for i∈A _(r)

ê∈±{0,

3. {circumflex over (T)} is output.

An AND operator proof verification protocol will be described below. This protocol determines the validity of an AND operator proof.

An input is PrimeEncodePredicate p (with AND operator), and an output is one {circumflex over (t)} value.

1. The following is calculated.

Ĉ:=C ^(−c)(Z ^(m) ^(r) )^({circumflex over (m)}) ^(h) S ^(r)(mod n) and

Ĉ ₀ :=C ^(−c) Z ^({circumflex over (m)}) S ^({circumflex over (r)})(mod n)

2. The length is verified.

{circumflex over (m)} _(h)∈±{0,

3. Ĉ and Ĉ₀ are output.

A NOT operator proof verification protocol will be described below. This protocol determines the validity of a NOT operator proof.

An input is PrimeEncodePredicate p (with NOT operator), and an output is one {circumflex over (t)} value.

{circumflex over (m)} is assumed to be an s value corresponding to an identifier designated in p, and m_(r) is assumed to be a constant. {circumflex over (m)}′, â, {circumflex over (b)}, and C are output values of the protocol.

1. The following is calculated.

Ĉ:=Z ^(c) C ^(â)(Z ^(m) ^(r) )^({circumflex over (b)}) S ^({circumflex over (r)}i)(mod n)

2. The length is verified.

{circumflex over (m)} _(i)∈±{0,

, for i∉A _(r)

3. Ĉ is output.

An inequality proof verification protocol will be described below. This is a proof verification protocol for <≤, >, and ≥ operators.

An input is InequalityPredicate p, and an output is one {circumflex over (t)} value.

1. When necessary, Δ′ is calculated, and c is updated,

$\Delta^{\prime}:=\left\{ {{\begin{matrix} b & {{{if}\mspace{14mu}*} \equiv \leq} \\ {b - 1} & {{{if}\mspace{14mu}*} \equiv <} \\ b & {{{if}\mspace{14mu}*} \equiv \geq} \\ {b + 1} & {{{if}\mspace{14mu}*} \equiv >} \end{matrix}a}:=\left\{ {{\begin{matrix} {- 1} & {{{if}\mspace{14mu}*} \equiv \leq \mspace{14mu}{or}\mspace{14mu} <} \\ 1 & {{{if}\mspace{14mu}*} \equiv \geq \mspace{14mu}{or}\mspace{14mu} >} \end{matrix}\Delta^{\prime}} = {m - {a\;\Delta}}} \right.} \right.$

2. A t value is calculated.

2.1 The following value is calculated.

{circumflex over (T)} _(Δ):=(T _(Δ) ^(a) Z ^(Δ′))^(−c) Z ^({circumflex over (m)})(S ^(a))^({circumflex over (T)}) ^(Δ) (mod n)

2.2 The following calculation is performed with respect to i∈{1, . . . , 4}.

{circumflex over (T)} _(i) :=T _(i) ^(−c) Z ^(û) ^(i) S ^({circumflex over (r)}) ^(t) (mod n)

2.3. The following value is calculated.

{circumflex over (Q)}:=(T _(Δ))^(−c) T ₁ ^(û) ¹ T ₂ ^(û) ² T ₃ ^(û) ³ T ₄ ^(û) ⁴ S ^({circumflex over (α)})(mod n)

3. t values {circumflex over (T)}_(Δ), {circumflex over (T)}₁, . . . , {circumflex over (T)}₄, and {circumflex over (Q)} are output.

A commitment proof verification protocol will be described below.

Inputs are comm and CommitmentPredicate p, and an output is one value.

{circumflex over (r)} is an s value, and

_({tilde over (r)}) and

_(r) are values defined by a commitment proof generation protocol.

1. The following values are calculated.

${C^{\prime}:={\frac{C}{\prod_{i \in {\mathfrak{J}}_{r}}R_{i}^{a_{i}}}\left( {{mod}\; n} \right)}},{\hat{C}:={\left( C^{\prime} \right)^{- c}\left( {\prod\limits_{i \in {\mathfrak{J}}_{\overset{\_}{r}}}R_{i}^{{\hat{m}}_{i}}} \right){S^{\hat{r}}\left( {{mod}\; n} \right)}}}$

2. Ĉ is output.

A pseudonym/domain pseudonym proof verification protocol will be described below.

Inputs are nym or dNym and PseudonymPredicate or DomainNymPredicate p, and an output is one {circumflex over (t)} value.

p is a protocol indicating the value {circumflex over (r)}.

1. The following values are calculated.

nŷm:=nym ^(−c) g ^({circumflex over (m)}) ^(s) h ^({circumflex over (r)})(mod Γ) if nym≠⊥ and

d{circumflex over (N)}ym:=nym ^(−c) g _(dom) ^({circumflex over (m)}) ^(s) (mod Γ) if dNym≠⊥

(The index numbers of attribute values including pseudonym information of a recipient are changed to attribute values used for issuer verification)

2. nŷm and/or d{circumflex over (N)}ym are output.

A verifiable encryption proof verification protocol will be described below. This is a proof verification protocol for attribute-verifiable encrypted values.

Inputs are verEnc and ProveVerEnc p, and outputs are three {circumflex over (t)} values.

p is a protocol which receives the values {circumflex over (m)}₁ and {circumflex over (r)}.

1. The following values are calculated.

û:=u ^(−2c) g ^(2{circumflex over (r)})

ê:=u ^(−2c) y ₁ ^(2{circumflex over (r)}) h ^(2{circumflex over (m)}) ¹ , and

{circumflex over (v)}:=u ^(−2c)(y ₂

)^(2{circumflex over (r)})

2. û, ê, and {circumflex over (v)} are output.

7. Others

FIGS. 17 to 19 illustrate flow among a group member, a recipient, and a verifier according to the exemplary embodiment of the present invention.

Meanwhile, the decentralized group signature method for an issuer-anonymized credential system according to the exemplary embodiment of the present invention may be implemented in a computer system or recorded in a recording medium. The computer system may include at least one processor, a memory, a user input device, a data communication bus, a user output device, and a storage. Each of these elements performs data communication through a data communication bus.

The computer system may further include a network interface coupled to a network. The processor may be a central processing unit (CPU) or a semiconductor device that processes a command stored in a memory and/or a storage.

The memory and storage may include various forms of volatile or non-volatile storage media. For example, the memory may include a read only memory (ROM) and a random access memory (RAM).

Consequently, the decentralized group signature method for an issuer-anonymized credential system according to the exemplary embodiment of the present invention may be implemented in a computer-executable manner. When the decentralized group signature method for an issuer-anonymized credential system according to the exemplary embodiment of the present invention is performed in a computer device, the group signature method may be performed by computer-readable commands.

Meanwhile, the above-described decentralized group signature method for an issuer-anonymized credential system according to the exemplary embodiment of the present invention can be implemented as a computer-readable code in a computer-readable recording medium. The computer-readable recording medium may include all types of recording media storing data that is interpretable by a computer system. Examples of the computer-readable recording media may include a ROM, a RAM, a magnetic tape, a magnetic disc, a flash memory, an optical data storage device, and the like. Also, the computer-readable recording medium may be distributed over a computer system connected by a computer communication network and stored and executed as a code which is readable in a distributed manner.

The present invention provides a decentralized group signature scheme for serving as a group manager with agreement of group members without a representative.

According to the present invention, since each group member can make an initial setup without using a reliable organization or a specific reliable member, security is high. Also, the present invention can be used in a credential system to provide anonymity of issuers.

Effects of the present invention are not limited to those mentioned above, and other effects which have not been mentioned will be clearly understood by those of ordinary skill in the art from the above description.

The present invention has been described in detail above with reference to the exemplary embodiments. Those of ordinary skill in the art should be able to understand that various modifications and alterations can be made without departing from the essential characteristics of the present invention. Therefore, it should be understood that the disclosed embodiments are not limiting but illustrative in all aspects. The scope of the present invention is defined not by the above description but by the following claims, and it should be understood that all changes or modifications equivalent to the claims fall within the scope of the present invention.

The components described in the example embodiments may be implemented by hardware components including, for example, at least one digital signal processor (DSP), a processor, a controller, an application-specific integrated circuit (ASIC), a programmable logic element, such as an FPGA, other electronic devices, or combinations thereof. At least some of the functions or the processes described in the example embodiments may be implemented by software, and the software may be recorded on a recording medium. The components, the functions, and the processes described in the example embodiments may be implemented by a combination of hardware and software.

The method according to example embodiments may be embodied as a program that is executable by a computer, and may be implemented as various recording media such as a magnetic storage medium, an optical reading medium, and a digital storage medium.

Various techniques described herein may be implemented as digital electronic circuitry, or as computer hardware, firmware, software, or combinations thereof. The techniques may be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device (for example, a computer-readable medium) or in a propagated signal for processing by, or to control an operation of a data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program(s) may be written in any form of a programming language, including compiled or interpreted languages and may be deployed in any form including a stand-alone program or a module, a component, a subroutine, or other units suitable for use in a computing environment. A computer program may be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.

Processors suitable for execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. Elements of a computer may include at least one processor to execute instructions and one or more memory devices to store instructions and data. Generally, a computer will also include or be coupled to receive data from, transfer data to, or perform both on one or more mass storage devices to store data, e.g., magnetic, magneto-optical disks, or optical disks. Examples of information carriers suitable for embodying computer program instructions and data include semiconductor memory devices, for example, magnetic media such as a hard disk, a floppy disk, and a magnetic tape, optical media such as a compact disk read only memory (CD-ROM), a digital video disk (DVD), etc. and magneto-optical media such as a floptical disk, and a read only memory (ROM), a random access memory (RAM), a flash memory, an erasable programmable ROM (EPROM), and an electrically erasable programmable ROM (EEPROM) and any other known computer readable medium. A processor and a memory may be supplemented by, or integrated into, a special purpose logic circuit.

The processor may run an operating system (OS) and one or more software applications that run on the OS. The processor device also may access, store, manipulate, process, and create data in response to execution of the software. For purpose of simplicity, the description of a processor device is used as singular; however, one skilled in the art will be appreciated that a processor device may include multiple processing elements and/or multiple types of processing elements. For example, a processor device may include multiple processors or a processor and a controller. In addition, different processing configurations are possible, such as parallel processors.

Also, non-transitory computer-readable media may be any available media that may be accessed by a computer, and may include both computer storage media and transmission media.

The present specification includes details of a number of specific implements, but it should be understood that the details do not limit any invention or what is claimable in the specification but rather describe features of the specific example embodiment. Features described in the specification in the context of individual example embodiments may be implemented as a combination in a single example embodiment. In contrast, various features described in the specification in the context of a single example embodiment may be implemented in multiple example embodiments individually or in an appropriate sub-combination. Furthermore, the features may operate in a specific combination and may be initially described as claimed in the combination, but one or more features may be excluded from the claimed combination in some cases, and the claimed combination may be changed into a sub-combination or a modification of a sub-combination.

Similarly, even though operations are described in a specific order on the drawings, it should not be understood as the operations needing to be performed in the specific order or in sequence to obtain desired results or as all the operations needing to be performed. In a specific case, multitasking and parallel processing may be advantageous. In addition, it should not be understood as requiring a separation of various apparatus components in the above described example embodiments in all example embodiments, and it should be understood that the above-described program components and apparatuses may be incorporated into a single software product or may be packaged in multiple software products.

It should be understood that the example embodiments disclosed herein are merely illustrative and are not intended to limit the scope of the invention. It will be apparent to one of ordinary skill in the art that various modifications of the example embodiments may be made without departing from the spirit and scope of the claims and their equivalents.

The method according to an embodiment of the present invention may be implemented in a computer system or may be recorded in a recording medium. FIG. 16 illustrates a simple embodiment of a computer system. As illustrated, the computer system may include one or more processors 921, a memory 923, a user input device 926, a data communication bus 922, a user output device 927, a storage 928, and the like. These components perform data communication through the data communication bus 922.

Also, the computer system may further include a network interface 929 coupled to a network. The processor 921 may be a central processing unit (CPU) or a semiconductor device that processes a command stored in the memory 923 and/or the storage 928.

The memory 923 and the storage 928 may include various types of volatile or non-volatile storage mediums. For example, the memory 923 may include a ROM 924 and a RAM 925.

Thus, the method according to an embodiment of the present invention may be implemented as a method that can be executable in the computer system. When the method according to an embodiment of the present invention is performed in the computer system, computer-readable commands may perform the producing method according to the present invention.

The method according to the present invention may also be embodied as computer-readable codes on a computer-readable recording medium. The computer-readable recording medium is any data storage device that may store data which may be thereafter read by a computer system. Examples of the computer-readable recording medium include read-only memory (ROM), random access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, and optical data storage devices. The computer-readable recording medium may also be distributed over network coupled computer systems so that the computer-readable code may be stored and executed in a distributed fashion. 

What is claimed is:
 1. A decentralized group signature method for an issuer-anonymized credential system, the decentralized group signature method comprising: (a) an initial system setup operation of defining elements of a group signature method and information that is generated and shared by each group member; (b) an initial group member setup operation; (c) a group member participation operation of adding a new group member to a group; (d) a group signature operation of putting a group signature on a specific message; (e) an operation of verifying the group signature; (f) an operation of removing anonymity from a group signature for a specific group member with agreement of group members; and (g) an operation of revoking a specific group member with agreement of the group members, wherein exclusive authority of a group manager is distributed to the group members.
 2. The decentralized group signature method of claim 1, wherein in the operation (a), the group members know the number of initial group members, a quorum required for agreement, public keys of the group members, a hash function, and a commitment generation function, generate public key pairs and identifier pairs, and share public values with one another.
 3. The decentralized group signature method of claim 1, wherein the operation (b) comprises: an operation of generating a polynomial of each group member; an operation of sharing polynomial verification data of each group member; an operation of sharing a polynomial value of each group member; an operation of combining polynomial and verification data of each group member; and an operation of verifying the combined polynomial.
 4. The decentralized group signature method of claim 3, wherein the operation of generating the polynomial of each group member comprises generating a polynomial used for anonymity removal and a polynomial used for signing.
 5. The decentralized group signature method of claim 3, wherein the operation of sharing polynomial verification data of each group member comprises generating a polynomial commitment value for checking integrity of the polynomial and generating and sharing, by each group member, a public parameter.
 6. The decentralized group signature method of claim 3, wherein the operation of sharing the polynomial value of each group member comprises calculating a polynomial value for a blind identifier of a group member and verifying the calculated polynomial value.
 7. The decentralized group signature method of claim 3, wherein the operation of combining the polynomial and verification data of each group member comprises combining the values generated by the group members to generate a common group parameter.
 8. The decentralized group signature method of claim 1, wherein the operation (c) comprises: an operation of sharing data of each group member for participation of a new group member; an operation of generating a polynomial of the new group member; and an operation of verifying the polynomial of the new group member.
 9. The decentralized group signature method of claim 8, wherein the operation of sharing the data of each group member for participation of the new group member comprises, when a group participation request of the new group member is made using a group member identifier for interoperation with an anonymous authentication system, making responses by the existing group members.
 10. The decentralized group signature method of claim 8, wherein the operation of generating the polynomial of the new group member comprises generating, by the new group member, a polynomial to be used by the new group member as a group member when the new group member responses from a preset number of members or more.
 11. The decentralized group signature method of claim 10, wherein the operation of verifying the polynomial of the new group member comprises verifying, by the new group member, the polynomial generated by the new group member and specifying a group member who has given a wrong value when the verification fails.
 12. The decentralized group signature method of claim 1, wherein the operation (d) comprises: an operation of generating individual data required for signing; an operation of verifying received individual data; an operation of generating a polynomial to be used in checking the number of signed members; an operation of combining the received individual data and signing a message; an operation of transmitting partial message signature data; and an operation of verifying received partial signature data and generating a signature value.
 13. The decentralized group signature method of claim 12, wherein the operation of generating the individual data required for signing comprises: selecting, by each group member, a random value; generating, by each group member, individual signature data to constitute a signature; and transmitting, by each group member, the generated individual signature data to other group members.
 14. The decentralized group signature method of claim 1, wherein the operation (f) comprises: sharing information on an abnormal group member; and recovering, by each manager, a polynomial, and verifying the recovered polynomial to check user information.
 15. The decentralized group signature method of claim 14, wherein the operation (g) comprises revoking a group member who is disclosed in the operation (f) when a preset number of group members or more sign a revoking member list and check a value used by the member to be revoked. 